A Combined Optimiiation Method to Refine Knowledge Bases of Uncertain Rules
نویسندگان
چکیده
One of the important issues when designing effective expert systems is the validation and refinement of the acquired knowledge bases. The validation and refinement problem becomes more important and more difficult when the knowledge bases of expert systems consist of uncertain rules, e.g., probabilistic rules. In this paper, we first describe one type of inconsistency of knowledge bases called sociopathicity and summarize some results. We then develop the Combined Optimization Method to debug this type of knowledge bases. This method utilizes the static and dynamic information of the rules. ’ Our experiments show that the debugged knowledge bases by the method significantly improve the system performance on the validation sets as well as on the training sets. The experimental results also empirically verify the manifestation of the sociopathic interactions among the rules and the improbability of locally debugging this type of inconsistent knowledge bases.
منابع مشابه
Improving the Performance of Inconsistent Knowledge Bases via Combined Optimization Method
One of the important issues when designing effective expert systems is the validation and refinement of the acquired knowledge bases. The validation and refinement problem becomes more important and more difficult when the knowledge bases of expert systems consist of uncertain rules, e.g., probabilistic rules. In this paper, we first describe one type of inconsistency of knowledge bases called ...
متن کاملCombining Neural and Symbolic Learning to Revise Probabilistic Rule Bases
This paper describes RAPTURE a system for revising probabilistic knowledge bases that combines neural and symbolic learning methods. RAPTURE uses a modified version of backpropagation to refine the certainty factors of a MYCIN-style rule base and uses ID3's information gain heuristic to add new rules. Results on refining two actual expert knowledge bases demonstrate that this combined approach ...
متن کاملProceedings of the Eleventh International Workshop on Machine Learning pp . 173 - 180 ,
This paper compares two methods for re ning uncertain knowledge bases using propositional certainty-factor rules. The rst method, implemented in the Rapture system, employs neural-network training to rene the certainties of existing rules but uses a symbolic technique to add new rules. The second method, based on the one used in the Kbann system, initially adds a complete set of potential new r...
متن کاملAppears in Proceedings of The 11 th International Conference on Machine Learning ( ML - 94 )
This paper compares two methods for reen-ing uncertain knowledge bases using propo-sitional certainty-factor rules. The rst method, implemented in the Rapture system , employs neural-network training to re-ne the certainties of existing rules but uses a symbolic technique to add new rules. The second method, based on the one used in the Kbann system, initially adds a complete set of potential n...
متن کاملProceedings of the Eleventh International Workshop on Machine Learning
This paper compares two methods for reen-ing uncertain knowledge bases using propo-sitional certainty-factor rules. The rst method, implemented in the Rapture system , employs neural-network training to re-ne the certainties of existing rules but uses a symbolic technique to add new rules. The second method, based on the one used in the Kbann system, initially adds a complete set of potential n...
متن کامل